Tight Fault Locality (Extended Abstract)
نویسندگان
چکیده
The notion of fault local mending was suggested as a paradigm for designing fault tolerant algorithms that scale to large networks. For such algorithms the complexity of recovering is proportional to the number of faults. We refine this notion by introducing the concept of tight fault locality to deal with problems whose complexity (in the absence of faults) is sublinear in the size of the network. For a function whose complexity on an n-node network is f (n ) , a tightly fault local algorithm recovers a legal global state in O(f(z)) time when the (unknown) number of faults is z. We illustrate this concept by presenting a general transformation for MIS algorithms to make them fault local. In particular, our transformation yields an O(1og z ) randomized mending algorithm and a 2deterministic mending algorithm for MIS. Similar results are obtained for other local functions such as A + 1 coloring. We also present the first tight fault local mending algorithm for global functions, using our results for MIS. This improves (by a logarithmic factor) the complexity of a previous fault-local mending algorithm for global functions.
منابع مشابه
Tight Fault Locality
This paper lays a theoretical foundation for scaling fault tolerant tasks to large and diversiied networks, such as the Internet. In such networks, there are always parts of the network that failed. On the other hand, various subtasks interest only parts of the network, and it is desirable that those parts, if nonfaulty, do not suuer from faults in other parts. Our approach is to reene the prev...
متن کاملFault-tolerant logical gates in quantum error-correcting codes∗
Recently, Bravyi and König have shown that there is a trade-off between fault-tolerantly implementable logical gates and geometric locality of stabilizer codes. They consider locality-preserving operations which are implemented by a constant-depth geometrically-local circuit and are thus fault-tolerant by construction. In particular, they shown that, for local stabilizer codes in D spatial dime...
متن کاملCompiler and Run-time Support for Improving Locality in Scientiic Codes (extended Abstract)
متن کامل
Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract)
In the paper, we analyze the computational power of 2 and 3-dimensional processor arrays that contain a potentially large number of faults. We consider both a random a and worst-case fault model, and we prove that in either scenario, low-dimensional arrays are surprisingly fault-tolerant. For example, we show how to emulate an n e x n m fault-free array on an n x n array containing Q(n2) random...
متن کاملFault detection and isolation of the attitude control subsystem of spacecraft formation flying using extended Kalman filters
Abstract—In this paper, the problem of fault detection and isolation in the attitude control subsystem of spacecraft formation flying is considered. In order to design the fault detection method, an extended Kalman filter is utilized which is a nonlinear stochastic state estimation method. Three fault detection architectures, namely, centralized, decentralized, and semi-decentralized are design...
متن کامل